Generalized Degree-Based Graph Entropies

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Degree-Based Graph Entropies

Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies ...

متن کامل

Some New Properties for Degree-Based Graph Entropies

The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks. In this paper, we continue studying some new properties of the graph entropies based on information functionals involving vertex degrees. We prove the monotonicity of the graph entropies with respect to the power exponent....

متن کامل

Inferring degree of nonextensivity for generalized entropies

The purpose of this note is to argue that degree of nonextensivity as given by the Tsallis distribution obtained from maximum entropy principle has a different origin than the nonextensivity inferred from pseudo-additive property of Tsallis entropy. PACS: 05.20.-y, 05.30.-d

متن کامل

Towards Information Inequalities for Generalized Graph Entropies

In this article, we discuss the problem of establishing relations between information measures for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the Rényi entropy have been considered for this study. Our main results involve establishing formal relationships, by means of inequalities, between these two kinds of measures. Further, we ...

متن کامل

Entropies for complex systems: generalized-generalized entropies

Many complex systems are characterized by non-Boltzmann distribution functions of their statistical variables. If one wants to – justified or not – hold on to the maximum entropy principle for complex statistical systems (non-Boltzmann) we demonstrate how the corresponding entropy has to look like, given the form of the corresponding distribution functions. By two natural assumptions that (i) t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2017

ISSN: 2073-8994

DOI: 10.3390/sym9030029